Polygon Dissections Complexes Are Shellable
نویسنده
چکیده
All dissections of a convex (mn + 2)-gons into (m + 2)-gons are facets of a simplicial complex. This complex is introduced by S. Fomin and A.V. Zelevinsky in [7]. We reprove the result of E. Tzanaki about shellability of such complex by finding a concrete shelling order. Also, we use this shelling order to find a combinatorial interpretation of h-vector and to describe the generating facets of these complexes.
منابع مشابه
Polygon Dissections and Some Generalizations of Cluster Complexes for the Classical Reflection Groups
We define a simplicial complex ∆ W in terms of polygon dissections for every classical reflection group W and positive integer m. For m = 1, ∆ W is isomorphic to the cluster complex corresponding to W , defined in [8]. We enumerate the faces of ∆ W and show that the entries of its h-vector are given by the generalized Narayana numbers N W (i), defined in [3]. We also prove that for any m ≥ 1 th...
متن کاملPolygon dissections and some generalizations of cluster complexes
Let W be a Weyl group corresponding to the root system An−1 or Bn. We define a simplicial complex ∆mW in terms of polygon dissections for such a group and any positive integer m. For m = 1, ∆ W is isomorphic to the cluster complex corresponding to W , defined in [9]. We enumerate the faces of ∆ W and show that the entries of its h-vector are given by the generalized Narayana numbers N W (i), de...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملDissections, Hom-complexes and the Cayley trick
We show that certain canonical realizations of the complexes Hom(G,H) and Hom+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of ...
متن کاملIncremental construction properties in dimension two-- shellability, extendable shellability and vertex decomposability
We give new examples of shellable but not extendably shellable two dimensional simplicial complexes. They include minimal examples, which are smaller than those previously known. We also give examples of shellable but not vertex decomposable two dimensional simplicial complexes. Among them are extendably shellable ones. This shows that neither extendable shellability nor vertex decomposability ...
متن کامل